A Hybrid Algorithm for Secure Communication Using Hermitian Matrix

نویسندگان

  • R. T. PaneerSelvam
  • V. Vaithyanathan
چکیده

Currently secure communication is a very challenging task. Cryptography is providing solution to this challenge. But cryptography highly depends on invertible mathematical functions. Mathematical stuff embedded with computer model brings the unbreakable cryptosystem. Many algorithms are proposed in the literature and they are having their own limitations. In this paper, an algorithm based on Hermitian theory to hide a text in an image is proposed. Properties of Hermitian theory reduce the complexity of sharing a dynamic key between a sender and a receiver. The efficiency and the flexibility of the proposed model is analyzed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Convergence Properties of Hermitian and Skew Hermitian Splitting Methods

In this paper we consider the solutions of linear systems of saddle point problems‎. ‎By using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method‎.

متن کامل

A Secure Routing Algorithm for Underwater Wireless Sensor Networks

Recently, underwater Wireless Sensor Networks (UWSNs) attracted the interest of many researchers and the past three decades have held the rapid progress of underwater acoustic communication. One of the major problems in UWSNs is how to transfer data from the mobile node to the base stations and choosing the optimized route for data transmission. Secure routing in UWSNs is necessary for packet d...

متن کامل

ALGORITHM & DOCUMENTATION: MINRES-QLP for Symmetric and Hermitian Linear Equations and Least-Squares Problems pdfsubject=MINRES-QLP for indefinite or singular symmetric systems

We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013